APPROX 2000 : approximation algorithms for combinatorial optimization (Saarbrücken, 5-8 September 2000)Jansen, Klaus; Khuller, Samir.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-67996-0, IX, 273 p, isbn 3-540-67996-0Conference Proceedings

AN EPTAS FOR SCHEDULING JOBS ON UNIFORM PROCESSORS: USING AN MILP RELAXATION WITH A CONSTANT NUMBER OF INTEGRAL VARIABLESJANSEN, Klaus.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 457-485, issn 0895-4801, 29 p.Article

The mutual exclusion scheduling problem for permutation and comparability graphsJANSEN, Klaus.Information and computation (Print). 2003, Vol 180, Num 2, pp 71-81, issn 0890-5401, 11 p.Article

Approximate strong separation with application in fractional graph coloring and preemptive schedulingJANSEN, Klaus.Theoretical computer science. 2003, Vol 302, Num 1-3, pp 239-256, issn 0304-3975, 18 p.Article

Approximation and online algorithms (Budapest, 16-18 September 2003, revised papers)Jansen, Klaus; Solis-Oba, Roberto.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-21079-2, VIII, 268 p, isbn 3-540-21079-2Conference Proceedings

Approximation algorithms for min-max and max-min resource sharing problems, and applicationsJANSEN, Klaus.Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications). Lecture notes in computer science. 2006, pp 156-202, issn 0302-9743, isbn 3-540-32212-4, 1Vol, 47 p.Book Chapter

List scheduling in order of α-points on a single machineSKUTELLA, Martin.Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications). Lecture notes in computer science. 2006, pp 250-291, issn 0302-9743, isbn 3-540-32212-4, 1Vol, 42 p.Book Chapter

Instant recognition of polynomial time solvability, half integrality and 2-approximationsHOCHBAUM, D. S.Lecture notes in computer science. 2000, pp 2-14, issn 0302-9743, isbn 3-540-67996-0Conference Paper

New results for online page replicationFLEISCHER, R; SEIDEN, S.Lecture notes in computer science. 2000, pp 144-154, issn 0302-9743, isbn 3-540-67996-0Conference Paper

On the hardness of approximating spannersKORTSARZ, G.Lecture notes in computer science. 1998, pp 135-146, issn 0302-9743, isbn 3-540-64736-8Conference Paper

The t- vertex cover problem : Extending the half integrality framework with budget constraintsHOCHBAUM, D. S.Lecture notes in computer science. 1998, pp 111-122, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Approximation algorithms for edge-disjoint paths and unsplittable flowERLEBACH, Thomas.Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications). Lecture notes in computer science. 2006, pp 97-134, issn 0302-9743, isbn 3-540-32212-4, 1Vol, 38 p.Book Chapter

A simpler proof of preemptive total flow time approximation on parallel machinesLEONARDI, Stefano.Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications). Lecture notes in computer science. 2006, pp 203-212, issn 0302-9743, isbn 3-540-32212-4, 1Vol, 10 p.Book Chapter

Approximating node connectivity problems via set coversKORTSARZL, G; NUTOV, Z.Lecture notes in computer science. 2000, pp 194-205, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Inapproximability results for set splitting and satisfiability problems with no mixed clausesGURUSWAMI, V.Lecture notes in computer science. 2000, pp 155-166, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Rectangle tilingLORYS, K; PALUCH, K.Lecture notes in computer science. 2000, pp 206-213, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Variable length Sequencing with two lengthsBERMAN, P; FUKUYAMA, J.Lecture notes in computer science. 2000, pp 51-59, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Best possible approximation algorithm for MAX SAT with cardinality constraintSVIRIDENKO, M. I.Lecture notes in computer science. 1998, pp 193-199, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Finding dense subgraphs with semidefinite programmingSRIVASTAV, A; WOLF, K.Lecture notes in computer science. 1998, pp 181-191, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Online deadline scheduling: Team adversary and restartLEE, Jae-Ha.Lecture notes in computer science. 2004, pp 206-213, issn 0302-9743, isbn 3-540-21079-2, 8 p.Conference Paper

On the inapproximability of broadcasting timeSCHINDELHAUER, C.Lecture notes in computer science. 2000, pp 226-237, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Approximating maximum independent set in k-clique-free graphsSCHIERMEYER, I.Lecture notes in computer science. 1998, pp 159-168, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Approximations of independent sets in graphsHALLDORSSON, M. M.Lecture notes in computer science. 1998, pp 1-13, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Minimum sum multicoloring on the edges of treesMARX, Daniel.Lecture notes in computer science. 2004, pp 214-226, issn 0302-9743, isbn 3-540-21079-2, 13 p.Conference Paper

Factor 4/3 approximations for minimum 2-connected subgraphsVEMPALA, S; VETTA, A.Lecture notes in computer science. 2000, pp 262-273, issn 0302-9743, isbn 3-540-67996-0Conference Paper